Provably secure server-aided verification signatures
نویسندگان
چکیده
منابع مشابه
Fast Server-Aided RSA Signatures Secure Against Active Attacks
Small units like chip cards have the possibility of computing, storing and protecting data. Today such chip cards have limited computing power, then some cryptoprotocols are too slow. Some new chip cards with secure fast coprocessors are coming but are not very reliable at the moment and a little bit expensive for some applications. In banking a p plications there are few servers (ATM) relative...
متن کاملServer (Prover/Signer)-Aided Verification of Identity Proofs and Signatures
Discrete log based identiication and signature schemes are well-suited to identity proof and signature generation, but not suitable for veriication, by smart cards, due to their highly asymmetric computational load between the prover/signer and the veriier. In this paper, we present very eecient and practical protocols for fast veriication in these schemes, where the veriier with limited comput...
متن کاملProvably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral conditions, or whatever) in the resulting signatures under some agreement with the receiver. This paper formalizes such a notion and presents secure and efficient schemes based on a widely applicable method of obtaining witnes...
متن کاملExperimenting with Server-Aided Signatures
This paper explores practical and conceptual implications of using Server-Aided Signatures (SAS). SAS is a signature method that relies on partially-trusted servers for generating public key signatures for regular users. Besides its two primary goals of 1) aiding small, resource-limited devices in computing heavyweight (normally expensive) digital signatures and 2) fast certificate revocation, ...
متن کاملProvably Secure Convertible Undeniable Signatures with Unambiguity
This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model and discrete logarithm setting. They further satisfy unambiguity, which is traditionally required for anonymous signatures. Briefly, unambiguity means that it is hard to generate a (message, signature) pair which is valid for two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.01.036